Rule Induction with CN2: Some Recent Improvements
نویسندگان
چکیده
The CN2 algorithm induces an ordered list of classiication rules from examples using entropy as its search heuristic. In this short paper, we describe two improvements to this algorithm. Firstly, we present the use of the Laplacian error estimate as an alternative evaluation function and secondly, we show how unordered as well as ordered rules can be generated. We experimentally demonstrate signiicantly improved performances resulting from these changes, thus enhancing the usefulness of CN2 as an inductive tool. Comparisons with Quinlan's C4.5 are also made.
منابع مشابه
Rule induction for subgroup discovery with CN2-SD
Rule learning is typically used in solving classification and prediction tasks. However, learning of classification rules can be adapted also to subgroup discovery. This paper shows how this can be achieved by modifying the CN2 rule learning algorithm. Modifications include a new covering algorithm (weighted covering algorithm), a new search heuristic (weighted relative accuracy), probabilistic...
متن کاملSubgroup Discovery with CN2-SD
This paper investigates how to adapt standard classification rule learning approaches to subgroup discovery. The goal of subgroup discovery is to find rules describing subsets of the population that are sufficiently large and statistically unusual. The paper presents a subgroup discovery algorithm, CN2-SD, developed by modifying parts of the CN2 classification rule learner: its covering algorit...
متن کاملSequential Cover Rule Induction with PA3
Algorithms for induction of concept descriptions from examples are important tools in the fields of machine learning and knowledge discovery in databases. This paper presents an induction algorithm, named PA3, that learns a set of ordered rules from examples. Functionally inspired in AQ and CN2, this algorithm attempts to generalize the learned rules during the induction process and introduces ...
متن کاملBeam Search in Incremental Rule Learning
This paper describes ICN, an incremental version of the CN2 rule learning system. Unlike other incremental rule learning systems which learn rules gradually, adding and removing conditions in a hill-climbing search, ICN learns or unlearns each rule “all at once,” using beam search as in CN2. In batch training and testing with the forest cover prediction problem, ICN performs nearly as well as C...
متن کاملAnalysis of Example Weighting in Subgroup Discovery by Comparison of Three Algorithms on a Real-life Data Set
This paper investigates the implications of example weighting in subgroup discovery by comparing three state-of-the-art subgroup discovery algorithms, APRIORI-SD, CN2-SD, and SubgroupMiner on a real-life data set. While both APRIORI-SD and CN2-SD use example weighting in the process of subgroup discovery, SubgroupMiner does not. Moreover, APRIORI-SD uses example weighting in the post-processing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991